Feasible quantum communication complexity protocol
نویسندگان
چکیده
منابع مشابه
A feasible quantum communication complexity protocol
I show that a simple multi-party communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency η. The task is a communication complexity problem in which distant parties need to compute a function of the distributed inputs, while minimizing the amount of communication between them. A quantum optical setup is...
متن کاملQuantum communication complexity protocol with two entangled qutrits.
We formulate a two-party communication complexity problem and present its quantum solution that exploits the entanglement between two qutrits. We prove that for a broad class of protocols the entangled state can enhance the efficiency of solving the problem in the quantum protocol over any classical one if and only if the state violates Bell's inequality for two qutrits.
متن کاملMultiparty Quantum Communication Complexity
Quantum entanglement cannot be used to achieve direct communication between remote parties, but it can reduce the communication needed for some problems. Let each of k parties hold some partial input data to some fixed k-variable function f . The communication complexity of f is the minimum number of classical bits required to be broadcasted for every party to know the value of f on their input...
متن کاملQuantum communication and complexity
In the setting of communication complexity, two distributed parties want to compute a function depending on both their inputs, using as little communication as possible. The required communication can sometimes be signiicantly lowered if we allow the parties the use of quantum communication. We survey the main results of the young area of quantum communication complexity: its relation to telepo...
متن کاملQuantum Communication Complexity
Can quantum communication be more efficient than its classical counterpart? Holevo’s theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits—unless the two parties are entangled, in which case twice as many classical bits can be communicated but no more. In apparent contradiction, there are distributed computational task...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2001
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.65.012318